منابع مشابه
K-decomposability of Positive Maps
For any C-algebra A let A denote the set of all positive elements in A. A state on a unital C-algebra A is a linear functional ω : A → C such that ω(a) ≥ 0 for every a ∈ A and ω(I) = 1 where I is the unit of A. By S(A) we will denote the set of all states on A. For any Hilbert space H we denote by B(H) the set of all bounded linear operators on H . A linear map φ : A → B between C-algebras is c...
متن کاملstudy of hash functions based on chaotic maps
توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...
m at h . FA ] 3 0 Se p 20 05 DECOMPOSABILITY OF EXTREMAL POSITIVE MAPS ON M 2 ( C )
A map ϕ : Mm(C) → Mn(C) is decomposable if it is of the form ϕ = ϕ 1 + ϕ 2 where ϕ 1 is a CP map while ϕ 2 is a co-CP map. It is known that if m = n = 2 then every positive map is decomposable. Given an extremal unital positive map ϕ : M 2 (C) → M 2 (C) we construct concrete maps ϕ 1 and ϕ 2 which give a decomposition of ϕ. We also show that in most cases this decomposition is unique.
متن کاملPERFECT MATCHINGS AND k-DECOMPOSABILITY OF INCREASING TREES
A tree is called k-decomposable if it has a spanning forest whose components are all of size k. In this paper, we study the number of k-decomposable trees in families of increasing trees, i.e. labeled trees in which the unique path from the root to an arbitrary vertex forms an increasing sequence. Functional equations for the corresponding counting series are provided, yielding asymptotic or ev...
متن کاملOn Conditional Decomposability
The requirement of a language to be conditionally decomposable is imposed on a specification language in the coordination supervisory control framework of discrete-event systems. In this paper, we present a polynomial-time algorithm for the verification whether a language is conditionally decomposable with respect to given alphabets. Moreover, we also present a polynomial-time algorithm to exte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Expositiones Mathematicae
سال: 2006
ISSN: 0723-0869
DOI: 10.1016/j.exmath.2005.07.002